Recoverable mutual exclusion with abortability

Abstract Recent advances in non-volatile main memory (NVM) technology have spurred research on algorithms that are resilient to intermittent failures cause processes crash and subsequently restart. In this paper we present a Recoverable Mutual Exclusion (RME) algorithm supports abortability. Our guarantees FCFS strong liveness property: do not starve even runs consisting of infinitely many crashes, provided process crashes at most finite number times each its attempts. On DSM Relaxed-CC multiprocessors, incurs $$O(\min (k, \log n))$$ O ( min k , log n ) RMRs passage $$O(f+ \min f + an attempt, where n is the designed for, k point contention or f p during attempt. Strict CC multiprocessor, attempt complexities O ( ) $$O(f+n)$$ , respectively. uses only read, write, CAS operations, which commonly supported by multiprocessors. Attiya, Hendler, Woelfel proved that, with any mutual exclusion algorithm, least $$\varOmega (\log n)$$ Ω passage, if operations (in: Proc. Fortieth ACM Symposium Theory Computing, New York, NY, USA, 2008). This lower bound implies worst-case RMR complexity our optimal for Relaxed expanded version conference as reported Jayanti Joshi Atig Schwarzmann (eds) Networked Systems. Springer International Publishing, Cham, 2019), presented first from 2019) admits starvation when there aborts run. paper, fix shortcoming prove algorithm’s properties identifying inductive invariant.